On a Covering Property of Convex Sets

نویسنده

  • H. GROEMER
چکیده

Let [Kx, K2, ■ ■ ■ } be a class of compact convex subsets of euclidean M-space with the property that the set of their diameters is bounded. It is shown that the sets A, can be rearranged by the application of rigid motions so as to cover the total space if and only if the sum of the volumes of all the sets A, is infinite. Also, some statements regarding the densities of such coverings are proved. If {A,} = {Kx, K2, . . .} is a class of compact convex sets of euclidean ^-dimensional space R", we say that {A",} can cover R", or that {A",} permits a space covering, if there are rigid motions a, so that Rn c LifLioiKi. The volume of Kt will be denoted by v(Kt), and the diameter by d(Kt). In a recent report [1], G. D. Chakerian has discussed the problem of finding necessary and sufficient conditions on v(Kt) and d(K/) in order that a class {A,} permits a space covering. In the joint paper [2] we have proved, using an idea of G. T. Sallee, the special case n = 2 of the following theorem: Theorem 1. Let {A-,} (/ = I, 2, . . . ) be a class of compact convex subsets of R" with the property that for some constant M and for i = 1, 2, ... , (1) d(Kt) < M. Then {A,} can cover R" if and only if OO (2) £ «(*/)=«>• I1 In the present paper this theorem will be proved in full generality. First we formulate and prove a theorem regarding coverings of the unit cube by a finite number of intervals (Theorem 2). From this theorem it will not only be possible to deduce Theorem 1, but also a more precise statement involving the densities of such coverings (Corollary 1). It should be mentioned that there is a kind of a "dual" of Theorem 2 concerning packings of convex sets rather than coverings (see Kosihski [5]). Theorem 3 shows the possibility of space coverings of density 1 by rather general collections of intervals. As a consequence of this theorem we can deduce another statement (Corollary 2) that establishes, under stronger assumptions than those in Corollary 1, a smaller bound for the densities of coverings of R" by convex sets. Received by the editors September 27, 1975 and, in revised form, January 5, 1976. AMS (MOS) subject classifications (1970). Primary 52A45; Secondary 05B40, 52A20.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A convex combinatorial property of compact sets in the plane and its roots in lattice theory

K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...

متن کامل

Functionally closed sets and functionally convex sets in real Banach spaces

‎Let $X$ be a real normed  space, then  $C(subseteq X)$  is  functionally  convex  (briefly, $F$-convex), if  $T(C)subseteq Bbb R $ is  convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$  is  functionally   closed (briefly, $F$-closed), if  $T(K)subseteq Bbb R $ is  closed  for all bounded linear transformations $Tin B(X,R)$. We improve the    Krein-Milman theorem  ...

متن کامل

Some results on functionally convex sets in real Banach spaces

‎We use of two notions functionally convex (briefly‎, ‎F--convex) and functionally closed (briefly‎, ‎F--closed) in functional analysis and obtain more results‎. ‎We show that if $lbrace A_{alpha} rbrace _{alpha in I}$ is a family $F$--convex subsets with non empty intersection of a Banach space $X$‎, ‎then $bigcup_{alphain I}A_{alpha}$ is F--convex‎. ‎Moreover‎, ‎we introduce new definition o...

متن کامل

On drop property for convex sets

Let (X, ‖ · ‖) be a real Banach space. Let C be a closed convex set in X. By a drop D(x, C) determined by a point x ∈ X, x / ∈ C, we shall mean the convex hull of the set {x} ∪ C. We say that C has the drop property if C 6= X and if for every nonvoid closed set A disjoint with C, there exists a point a ∈ A such that D(a, C) ∩ A = {a}. For a given C a sequence {xn} in X will be called a stream i...

متن کامل

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010